Hierarchical occupancy-based congestion management

ABSTRACT

A system for hierarchical occupancy based congestion management includes a buffer embodied in a computer readable storage medium including a plurality of buffer units for storing packets of a data flow received from sources. The system includes a buffer manager that stores information about the packets stored in the buffer, including a selection criterion associated with each of the plurality of sources and a congestion estimator that monitors a congestion level in the buffer. The system also includes a occupancy sampler that randomly selects at least two occupied buffer units from the plurality of buffer units and identifies the source of the packet stored in each of the occupied buffer units and a congestion notification message generator that generates a congestion notification message; wherein if the congestion level in the buffer exceeds a threshold value the congestion notification message is sent to the identified source with a higher selection criteria.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of, and claims priority to, U.S.application Ser. No. 13/330,441 filed on Dec. 19, 2011, the entirecontents of which are incorporated herein by reference.

BACKGROUND

The present disclosure relates to congestion management, and morespecifically, to hierarchical occupancy based congestion management.

Server farms, also known as data centers, are becoming more and moreutilized. Without proper congestion management, the increased networkutilization will reduce the performance of applications that utilizethese networks. Many data centers are using Converged Enhanced Ethernet(CEE) that allows high link speeds and short delays while introducinglossless operation beyond the lossy operation provided by traditionalEthernet.

Lossless CEE operation requires a distributed congestion managementsystem with congestion detection at congestion points. In response todetecting congestion, the congestion points send congestion notificationmessages to traffic sources, which instruct the traffic sources toreduce their data transmission rate. Current congestion managementschemes and congestion notification schemes are explicit arrival ratecongestion samplers that are triggered by new arrivals.

Congestion points include a buffer, typically assumed to be a FIFOqueue, which acts as a rate mismatch integrator. The congestion level ofthe buffer is determined by packet arrivals and the service times of thepackets leading to departures. The buffer accumulates the differencebetween the arrivals and the departures of the aggregate flow. Once thecongestion point determines that there is congestion in the buffer, thecongestion point randomly samples arriving packets and sends congestionnotification messages to the traffic sources of the sampled packets.

Accordingly, a data flow with a higher arrival rate at the congestionpoint is likely to be sampled more often than one with a lower arrivalrate. The congestion management system throttles the transmission rateof the data flows having higher arrival rates to the congestion pointmore than data flows having lower arrival rates. However, the arrivalrate of a data flow is not necessarily indicative of its relativecontribution to the congestion.

SUMMARY

According to one embodiment of the present disclosure, a system forhierarchical occupancy based congestion management includes a bufferembodied in a computer readable storage medium including a plurality ofbuffer units for storing packets of a data flow received from one ormore sources. The system includes a buffer manager that storesinformation about the packets stored in the buffer, including aselection criterion associated with each of the plurality of sources anda congestion estimator that monitors a congestion level in the buffer.The system also includes a occupancy sampler that randomly selects atleast two occupied buffer units from the plurality of buffer units andidentifies the source of the packet stored in each of the occupiedbuffer units and a congestion notification message generator thatgenerates a congestion notification message; wherein if the congestionlevel in the buffer exceeds a threshold value the congestionnotification message is sent to the identified source with a higherselection criteria.

Additional features and advantages are realized through the techniquesof the present disclosure. Other embodiments and aspects of thedisclosure are described in detail herein and are considered a part ofthe claimed disclosure. For a better understanding of the disclosurewith the advantages and the features, refer to the description and tothe drawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The subject matter which is regarded as the disclosure is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The forgoing and other features, and advantages ofthe disclosure are apparent from the following detailed descriptiontaken in conjunction with the accompanying drawings in which:

FIG. 1 is a block diagram illustrating one example of a processingsystem for practice of the teachings herein;

FIG. 2 is a flow chart illustrating a method for buffer occupancy basedcongestion management in accordance with an embodiment;

FIG. 3 is a block diagram illustrating a system for buffer occupancybased congestion management in accordance with an embodiment;

FIG. 4 is a block diagram of a switching fabric that includes acongestion point buffer operable for performing buffer occupancy basedcongestion management;

FIG. 5 is a block diagram illustrating a system for hybridarrival-occupancy based congestion management in accordance with anembodiment;

FIG. 6 is a flow chart illustrating a method for hybridarrival-occupancy based congestion management in accordance with anembodiment;

FIG. 7 is a block diagram illustrating a system for hierarchicaloccupancy-based congestion management in accordance with an embodiment;and

FIG. 8 is a flow chart illustrating a method for hierarchicaloccupancy-based congestion management in accordance with an embodiment.

DETAILED DESCRIPTION

Referring to FIG. 1, there is shown an embodiment of a processing system100 for implementing the teachings herein. In this embodiment, thesystem 100 has one or more central processing units (processors) 101 a,101 b, 101 c, etc. (collectively or generically referred to asprocessor(s) 101). In one embodiment, each processor 101 may include areduced instruction set computer (RISC) microprocessor. Processors 101are coupled to system memory 114 and various other components via asystem bus 113. Read only memory (ROM) 102 is coupled to the system bus113 and may include a basic input/output system (BIOS), which controlscertain basic functions of system 100.

FIG. 1 further depicts an input/output (I/O) adapter 107 and a networkadapter 106 coupled to the system bus 113. I/O adapter 107 may be asmall computer system interface (SCSI) adapter that communicates with ahard disk 103 and/or tape storage drive 105 or any other similarcomponent. Hard disk 103, and tape storage device 105 are collectivelyreferred to herein as mass storage 104. Software 120 for execution onthe processing system 100 may be stored in mass storage 104. A networkadapter 106 interconnects bus 113 with an outside network 116 enablingdata processing system 100 to communicate with other such systems. Ascreen (e.g., a display monitor) 115 is connected to system bus 113 bydisplay adaptor 112, which may include a graphics adapter to improve theperformance of graphics intensive applications and a video controller.In one embodiment, adapters 107, 106, and 112 may be connected to one ormore I/O busses that are connected to system bus 113 via an intermediatebus bridge (not shown). Suitable I/O buses for connecting peripheraldevices such as hard disk controllers, network adapters, and graphicsadapters typically include common protocols, such as the PeripheralComponents Interface (PCI). Additional input/output devices are shown asconnected to system bus 113 via user interface adapter 108 and displayadapter 112. A keyboard 109, mouse 110, and speaker 111 allinterconnected to bus 113 via user interface adapter 108, which mayinclude, for example, a Super I/O chip integrating multiple deviceadapters into a single integrated circuit.

Thus, as configured in FIG. 1, the system 100 includes processingcapability in the form of processors 101, storage capability includingsystem memory 114 and mass storage 104, input means such as keyboard 109and mouse 110, and output capability including speaker 111 and display115. In one embodiment, a portion of system memory 114 and mass storage104 collectively store an operating system such as the AIX® operatingsystem from IBM Corporation to coordinate the functions of the variouscomponents shown in FIG. 1.

A common congestion-control method for Converged Enhanced Ethernetnetworks is Quantized Congestion Notifications (QCN), which is supportedby a large number of network equipment vendors. Implementations of QCNcan be found in modern network interface cards (NICs). NICs supportingQCN, which implement reaction points and thus per-flow rate limiters atthe source, throttle the transmission rate of a flow in response to theflow receiving congestion notification messages from congestion pointsin the network. In order to close the congestion control feedback loop,companies that build proprietary or commodity switching systemssupporting QCN will implement congestion points at locations in theirswitching fabrics that need to share a queue or buffer among a pluralityof flows. The present invention also pertains to QCN congestion pointsthat may advantageously be provided in the NIC receive path for managingshared queues or buffers for a plurality of flows.

A congestion control function can be implemented by using QCN congestionpoint functions at the buffers located at the entry points of amultistage switching fabric. Within these fabric-input buffers, modernswitching fabrics implement virtual-output-queues (VOQs), where dataflows are segregated based on their destination, or class of service,and their departures are being scheduled on a per-flow basis, forexample, based upon the availability of downstream buffer locations, thepriorities assigned to the flows, or flow-dependent bandwidthconstraints. Traditionally, the congestion control functions used aper-flow discriminative flow control between the fabric and the upstreamsources that assumed a separate fabric-input buffer to be staticallyallocated per flow.

A congestion point mechanism capable of identifying congestive flows andthen selectively throttling them can be installed in a shared buffer ofthe congestion point. Congestive flows are those having a greaterarrival rate than departure rate at the congestion point, hence buildinga backlog. In the case of QCN, throttling is realized by sendingcongestion notification messages to the reaction points at the sourcesof the offensive flows.

In congestion control schemes like QCN, each feedback control loopincludes a congestion point, the buffer where congestion is detected,and the reaction points, which control the maximum sending rate offlows. When a flow causes congestion at a congestion point, thecongestion point will send congestion notification messages to thecorresponding reaction point telling it to decrease the sending rate ofthat flow. Sampling at the congestion point may be triggered eitherperiodically or based on a number of arrivals to the congestion point.According to prior art, when a congestion point detects congestion, itsends a congestion notification message to the flow of the currentlyarriving frame. Effectively, while the congestion point is congested,congestion notification messages are distributed to flows in proportionto their current arrival rates at the congestion point and thus their“present” sending rates. Accordingly, once an arrival rate of a flow isreduced, the rate of new congestion notification messages that are sentto that flow is also reduced.

The buffer usage by a flow is the key metric when sharing a buffer amongflows because it affects the ability of other flows to pass through thecongestion point. Standard QCN is designed to send congestionnotification messages to flows with higher arrival rates to thecongestion point. However, the arrival rate of a flow does notsufficiently characterize its contribution to the congestion of thebuffer. Instead, the buffer usage by a flow results from integrating thedifference between the arrival rate of a flow and its departure rate,i.e., this difference is the rate of change of the buffer usage of theflow.

Referring now to FIG. 2, a flow chart illustrating a method for bufferoccupancy based congestion management is shown. As shown at block 200, apacket is received and stored in the congestion point buffer. Atdecision block 202, the method includes determining if the congestionpoint buffer is congested. If the congestion point buffer is congested,a random occupied buffer unit is selected from the congestion pointbuffer, as shown at block 204. Based on the random occupied buffer unit,a congestion notification message is then generated as shown at block206. Next, the source of the packet occupying the random buffer unit isdetermined and the congestion notification message is sent to theidentified source, as shown at block 208.

In exemplary embodiments, the chance that a data source receives acongestion notification message is proportional to the percentage of thecongestion point buffer that the data source is using. In oneembodiment, the process of selecting an occupied buffer unit can includeconcurrently checking more than one buffer units. If more than one ofthe buffer units selected is occupied, one of the occupied units israndomly chosen to determine where to send the congestion notificationmessage. As used herein, a buffer unit refers to a fixed-size unit ofmemory or storage and a packet may be stored in a single or acrossmultiple buffer units. By randomly selecting a buffer unit from a poolof fixed-size buffer units, the probability of selecting a packetassociated with a particular flow or data source is given by thefraction of the congestion point buffer utilized by the flow or datasource.

In another embodiment, the buffer units may be selectable through anindex or global (over all flows) sequence count, which identifies bufferunits in the order of packet arrivals. The global sequence count permitsthe random selection of a flow with a probability that not onlyincreases with the relative buffer occupancy of the flow but also withthe age or waiting time of a packet, as the lowest global sequencenumbers correspond to the oldest packets.

The congestion level of the congestion point buffer can be sampledperiodically or in response to specific triggering events. In oneembodiment, the arrival of a new data packet at the congestion pointbuffer can be used to trigger a calculation of the current congestionlevel of the buffer. For example, the congestion level of the congestionpoint buffer can be checked upon the arrival of every n-th packetentering the congestion point buffer. If the congestion point buffer isdetermined to be congested, then an occupied buffer unit of thecongestion point buffer is randomly selected, the header of thecorresponding packet is located, a congestion notification message isgenerated based upon the header of the packet and sent to the source ofthe packet or frame indicated by the header. In another embodiment, acalculation of the current congestion level of the buffer can beperformed on a periodic basis, where the time interval may be constantor may increase and decrease based upon the calculated congestion level.For example, the congestion level may be checked once every hundredmicroseconds until the congestion level exceeds a threshold value, atwhich point the time interval can be decreased to a shorter period oftime.

In exemplary embodiments, the sampling probability of a data flow isgiven by the current percentage of congestion point buffer occupancyused by the data flow. For example, if the congestion point buffer holdspackets from three flows f1, f2, and f3, which have buffer occupanciesas q1, q2, and q3, then a congestion notification message will be sentto the source of f1 with probability p1=q1/(q1+q2+q3). In anotherexample, where two flows f1 and f2 initially contribute equally to thecongestion point arrival rate but have different congestion pointservice rates due an external constraint or flow-selective feedback fromdownstream network entities, the flows will converge to differentthroughput values given by their different service rates, i.e., they areno longer both limited to the minimum of these service rates.

One advantage of buffer occupancy based congestion management is that ittends to balance the average fraction of congestion point bufferoccupancy used by different flows even if departures from the congestionpoint buffer are out of order with respect to arrivals, for example, dueto flow control from downstream network entities. Another advantage isthat the data flows traversing the congestion point buffer at differentspeeds are not throttled according to their arrival rates but accordingto their average fraction of congestion point buffer occupancy, which isthe resource that the data flows share.

In one example, two data flows are sequentially activated with equalinitial arrival rates λ and departure rates μ, where λ is greater thanμ. These flows equally increase congestion point buffer occupancy at therate λ−μ. The first of the two data flows will occupy a largerpercentage of the congestion point buffer since it has had more time toaccumulate in the congestion point buffer. Accordingly, the first of thetwo data flows will have a higher probability of being selected forthrottling in favor of fairness and stability.

In another example, two flows f1 and f2 have initial, link-ratenormalized demand ratios of 0.1 and 0.5, respectively, and service ratesof 0.01 and 0.99. The service rates are assumed to be given by anexternal constraint such as a flow-dependent bandwidth limitation andmay be imposed by feedback from downstream network entities. A systemwith arrival sampling at the congestion point buffer would converge toan approximate rate of ˜0.01 for each flow, because the congestion pointbuffer occupancy would grow and f2 would be sampled more frequently thanf1 due to its higher arrival rate at the congestion point buffer.However, the buffer occupancy based congestion management system willthrottle only f1 to the 0.01 rate and allows f2 to maintain its 0.5rate. This is accomplished because the congestion point buffer occupancycontributed by f2 remains close to zero, while the congestion pointbuffer occupancy contributed by f1 is growing.

Turning now to FIG. 3, a block diagram illustrating a system for bufferoccupancy based congestion management in accordance with an exemplaryembodiment is shown. The system includes a congestion point buffer 300,an occupancy-based congestion point 302, a data source 304 and a datadestination 308. The congestion point buffer 300 includes a plurality ofbuffer units 301 for storing data packets. The congestion point buffer300 receives data flows from one or more data sources 304 and sends thedata flows to one or more data destinations 308. The occupancy-basedcongestion point 302 manages the operation of one or more congestionpoint buffers 300.

The occupancy-based congestion point 302 includes a congestion pointbuffer manager 306, a congestion estimator 310, an occupancy sampler 312and a congestion notification message generator 314. In addition, theoccupancy-based congestion point 302 may include a stimulus generator316. The buffer manager 306 stores information about the data packetsstored in the congestion point buffer 300. The congestion estimator 310uses the information stored by the buffer manager 306 to calculate andmonitor the level of congestion in the congestion point buffer 300. Oncethe congestion estimator 310 determines that the congestion in thecongestion point buffer 300 has exceeded a threshold value, theoccupancy sampler 312 randomly selects one or more occupied buffer unitsof the congestion point buffer 300 and determines the source of the datastored in the buffer unit 301. The congestion notification messagegenerator 314 sends a congestion notification message to the source ofthe data stored in the buffer unit 301 selected by the occupancy sampler312. The congestion notification message is used to instruct the senderto decrease the rate at which it is sending data to the congestionpoint. The stimulus generator 316 may be used to trigger the congestionestimator 310 to calculate the current congestion level in thecongestion point buffer 300 and to generate congestion notificationmessages at 310 either in response to new arrivals or, during theirabsence, in an autonomous fashion.

In an exemplary embodiment, data packets received from one or more datasources 304 are stored in multiple fixed-size buffer units 301 of thecongestion point buffer 300. The buffer units 301 can be assigned todata packets by the buffer manager 306 from a FIFO queue or free listthat includes a record of all empty buffer units 301. The congestionpoint buffer manager 306 stores information on the usage of buffer units301 and updates this information whenever new packets are stored in thecongestion point buffer 300 or when stored packets are removed from thecongestion point buffer 300. The congestion point buffer 300 maytransmit the data packets and retain the packet for a period of time.For example, the congestion point buffer 300 may transmit the datapacket and retain a copy of the packet until it receives anacknowledgement that the packet was received. Alternatively, thecongestion point buffer 300 may be designed to discard the data packetfrom the buffer after transmitting the packet. In addition, relevantinformation for packets consuming multiple buffer units 301 is stored bythe buffer manager 306 and may include the location of the head bufferunit if a data packet is stored across multiple buffer units 301. If thecongestion point buffer 300 covers multiple congestion points, ordifferent priorities stored in a single congestion point buffer 300, thebuffer manager 306 also contains information distinguishing thedifferent congestion points, or priorities.

In exemplary embodiments, the congestion estimator 310 determines if thecongestion point buffer 300 buffer is congested. If the congestionestimator 310 concludes that a congestion notification message is neededto reduce current or incipient congestion, the occupancy sampler 312randomly selects a buffer unit 301 from the congestion point buffer 300and determines the source of the packet in the selected buffer unit 301.If the selected buffer unit 301 is not occupied, or if the buffer unitbelongs to a packet that doesn't match additional search criteria, or—incase of multiple congestion points/priorities using a shared buffer—ifthe data stored in the buffer unit belongs to a wrong congestionpoint/priority, the search is continued until an occupied buffer unit301 or a buffer unit 301 matching the search criteria is found. Once asuitable buffer unit 301 has been found, information from the buffermanager 306 is used to identify the traffic source of the data stored inthe selected buffer unit 301. A corresponding congestion notificationmessage is then sent to the identified source by the congestionnotification message generator 314.

The occupancy sampler 312 can increase the speed of its search for anoccupied buffer unit 301 by searching multiple buffer units 301concurrently. In some cases, the occupancy sampler 310 may be prone toselect a flow with lower or higher probability based on the way thepackets of the data flow are clustered in physical buffer units 301. Inexemplary embodiments, to avoid any bias in selecting a data flow by theoccupancy sampler 310, the occupancy sampler 310 concurrently checksbuffer units 301 that are physically separated by m buffer units, wherem is chosen much larger than the number of buffer units 301 concurrentlychecked. Since buffer assignments for multi-buffer frames or flows aremade when the packets making up the frame or flow enter the congestionpoint buffer 300, it is probable that buffer units 301 having databelonging to the same frame or flow are physically adjacent, orclustered, within the congestion point buffer 300. If the distancebetween the concurrently checked buffer units is larger than the maximumframe or flow size in terms of buffer units 301, then there is a verylow probability that multiple buffer units checked concurrently willbelong to the same frame or flow. This probability may decrease withincreasing distance between physical buffer units. Moreover, multipleexecutions of the concurrent search will experience randomly distinctpatterns of buffer usage. Long term, the associated averaging tends toremove any random unfairness of individual executions.

In exemplary embodiments, the buffer manager 306 of the occupancy-basedcongestion point 302 may maintain a list of data flows in the congestionpoint buffer 300. Upon the determination that the congestion pointbuffer 300 is congested, a flow from this list is selected as a culpritflow, with a probability equal to the percentage of buffer unitsoccupied by the flow. Alternatively, a separate list of flows with ahigh occupancy may be maintained, and the culprit flow can be selectedfrom that list. In a second step, a packet belonging to the culprit flowis chosen and a congestion notification message is sent to the source ofthat packet. Like the direct random selection of a packet, this two-stepprocedure results in preferentially sending congestion notifications toflows with high buffer occupancy.

Generally the two different data flow sampling methods, arrival samplingand buffer occupancy sampling, each relate to distinct potential networkcongestion. Arrival sampling is a more accurate method of determiningcongestion on a network link, while buffer occupancy sampling is a moreaccurate method of determining congestion on the buffer. Arrivalsampling attempts to optimize the link utilization assuming theexistence of one or more arrival processes caused by multiple flowssharing the link. Buffer occupancy sampling optimizes the utilization ofa buffer that is shared by multiple data flows, without making anyassumptions about their respective incoming arrival processes. Aspractical network devices are subjected to both types of congestion,link and buffer, in exemplary embodiments the buffer occupancy basedcongestion management system may include aspects of both samplingmethods.

Referring now to FIG. 4, an illustration of a switching fabric 400 thatincludes a fabric-entry buffer 402, or congestion point buffer, and aswitching core 404 is shown. Congested data flows through the switchingfabric 400 can be categorized as being congested either at a switchingfabric output 406 or a switching fabric-internal link 408. Data flowsthat face congestion at a fabric-output 400 will depart from thecongestion point buffer 402 slowly, at a rate dictated by an arbiterwhich allocates the bandwidth of the fabric-output 406. Therefore,congested switching fabric output flows build backlogs at thefabric-entry buffer 402, which results in more congestion notificationmessages being generated for these flows under a buffer occupancysampling method.

Data flows that are congested at a fabric-internal link 408 of theswitching core 404 are not constrained at the fabric-output 406 andreceive fabric output credits/grants at full speed. However, because thedata flows are congested at a fabric-internal link 408, these flowsbuild backlogs in front of the internal link and effectively induce theformation of congestion trees. Depending on their severity, thesecongestion trees may reach the fabric-entry buffer 402 and constrain theprogress of all packets entering the switching fabric 400, whether theypass through the congested internal link 408 or not. In this case,buffer occupancy sampling may not be able to properly identify the flowsthat are responsible for the congestion tree, since the departure rateof all flows is dictated by the rate that the congested internal linksdrain packets, hence all flows may build similar backlogs.

Referring now to FIG. 5, a block diagram illustrating a system forhybrid arrival-occupancy based congestion management in accordance withan exemplary embodiment is shown. In an exemplary embodiment, the buffermanager 306 of the occupancy based-congestion point 302 includes a(per-flow) recent arrivals counter 318. The recent arrivals counter 318may be interpreted as a penalty counter. The recent arrivals counter 318of a flow, which includes packets from one or more data sources 304, isincreased with every new arrival at the congestion point buffer 300 of adata packet belonging to the flow. The recent arrivals counter 318 isdecreased every time that a new congestion notification message is sentto a source of the corresponding data flow. In one embodiment, therecent arrivals counter 318 can be increased and decreased by a valuethat is proportional to the size of the data packet that arrives orbased upon the severity of the congestion notification message sent. Therecent arrivals counter 318 can be set to have predefined upper andlower bounds. In exemplary embodiments, the recent arrivals counter 318is initially set to zero and may have a lower bound of zero. In anotherembodiment, the recent arrivals counter 318 can be increased by one witheach new data packet that arrives at the congestion point buffer 300 anddecreased by one with every new congestion notification message that issent.

Referring now to FIG. 6, a flow chart illustrating a method for hybridarrival-occupancy based congestion management in accordance with anexemplary embodiment is shown. As shown at block 500, a packet isreceived and stored in the congestion point buffer. At block 502, therecent arrivals counter for the data flow corresponding to the receivedpacket is incremented. Next, as shown at decision block 504, the methodincludes determining if the congestion point buffer is congested. If thecongestion point buffer is congested, a congestion notification messageis generated, as shown at block 506. Once the congestion notificationmessage has been generated, a random occupied buffer unit is selectedfrom the congestion point buffer, as shown at block 508. Next, thesource of the packet occupying the random buffer unit is determined, asshown at block 510. As shown at decision block 512, the method includesdetermining if the recent arrivals counter for the data flow associatedwith the source of the data packet stored in the selected occupiedbuffer unit is equal to zero. If the recent arrivals counter is notequal to zero, a congestion notification message is sent to the sourceof the data packet and the recent arrivals counter is decremented, asshown at block 514. Otherwise, the congestion notification message isdiscarded, as shown at block 516.

In exemplary embodiments, the use of the recent arrivals counter ensuresthat the data flow that is selected to be throttled has had recentarrival activity and protects against over-throttling a data flow. Forexample, if a data flow is inactive and has not had recent arrivalactivity it is likely that its recent arrivals counter will have a zerovalue and if the data flow is randomly selected for throttling the zerovalue recent arrivals counter will prevent a congestion notificationmessage from being sent to the inactive data flow. In another example,an active data flow has had recent arrival activity and its recentarrivals counter has a non-zero value. If the buffer experiencescongestion and the active data flow is selected for throttling, therecent arrivals counter will be decreased each time a congestionnotification message is sent to the data flow. Assuming the active dataflow is repeatedly selected for throttling, the upper bound of therecent arrivals counter will prevent the active data flow from beingover throttled.

Referring now to FIG. 7, a block diagram illustrating a system forhierarchical occupancy-based congestion management is shown. In anexemplary embodiment, the buffer manager 306 of the occupancybased-congestion point 302 includes selection criterion 320. Theselection criterion 320 can be used to select which data flows shouldreceive congestion notification messages. In one embodiment, a set of atleast two data flows at the congestion point buffer 300 are selectedusing buffer occupancy sampling. The buffer manager 306 then uses theselection criteria to select which of the at least two identified flowsto throttle. In exemplary embodiments, the selection criterion can bebased on the filling level of an internal fabric buffer, and data flowsthat pass through congested internal links will be identified and have ahigher probability of being sent congestion notification messages.

In exemplary embodiments, the selection criterion 320 is a congestionindex that is associated with each data flow. The congestion index is avariable that is used to rank the relative congestion that each dataflow is experiencing. In one embodiment, the congestion index can be avalue proportional to occupancy of a downstream buffer in the path ofthe data flow, the buffer manager 306 may receive this information fromthe data destination 308 or from a transmission scheduler 322. Forexample, the fabric-output may communicate a congestion index whichreflects its buffer occupancy to the fabric-entry buffer congestionpoint, which the occupancy-based congestion point 302 uses to selectwhich flow to throttle. In another embodiment, the congestion index of adata flow can be a value proportional to occupancy of the congestionpoint buffer 300. By using a congestion index in addition to bufferoccupancy sampling the congestion management system can identifyinternally-congested flows, while maintaining the advantages ofrandom-based occupancy-based sampling.

Referring now to FIG. 8, a flow chart illustrating a method forhierarchical occupancy-based congestion management is shown. As shown atblock 800, a packet is received and stored in the congestion pointbuffer. Next, at shown at decision block 802, the method includesdetermining if the congestion point buffer is congested. If thecongestion point buffer is congested, a congestion notification messageis generated, as shown at block 804. Once the congestion notificationmessage has been generated at least two random occupied buffer units areselected from the congestion point buffer, as shown at block 806. Next,the sources of the packets occupying the random buffer units aredetermined, as shown at block 808. Once the sources of the at least twodata packets are determined, the selection criteria of the at least twodata flows are compared, as shown at block 810. The congestionnotification is then sent to the source of the data flow with thegreater of the two selection criteria, as shown at block 812. Inexemplary embodiments, if the at least two randomly selected bufferunits contain data associated with the same data flow, additional randomsampling of the buffer units may be performed or the congestionnotification message may be sent to the common source of the at leasttwo selected buffer units.

In one embodiment, once the at least two occupied buffer units have beenhave been randomly sampled and their associated data flows have beenidentified, the route of each of these at least two data flows isdetermined. If a data flow is destined to a separate node from thecurrent congestion point, the congestion index is set to the occupancyof the downstream buffer in front of the distant link connecting to thetargeted node. If a data flow is heading to another node within the samecurrent congestion point, the congestion index is set to the bufferoccupancy in front of the local link going to the destination hub. Thecongestion notification message is then sent to the data flow withhigher congestion index.

In another embodiment, the congestion point selects at least two dataflows by randomly sampling the congestion point buffer 300 for at leasttwo occupied buffer units and finding the source data stored in the atleast two buffer units 301. The congestion index for each flow is set tothe buffer occupancy level at the congestion point buffer 300 and thecongestion notification message is sent to the flow with highercongestion index. In this way, the accuracy of random selection inimplementing occupancy-based sampling is improved. With standard randomselection from the congestion point buffer, there is always the chancethat a flow which is utilizing a small percentage of the buffer isselected. By randomly selecting at least two occupied buffer units tosample and then intelligently selecting between them, the accuracy ofrandom-selection occupancy sampling can be increased.

In an exemplary embodiment, the buffer manager 306 of theoccupancy-based congestion point 302 may save an identificationassociated with the last data flow that was throttled for future use inidentifying which data flow to throttle. Upon the detection ofcongestion in the congestion point buffer, one or more data flows areselected by randomly sampling the congestion point buffer and thecongestion index of the selected data flows is compared to thecongestion index of the last data flow throttled. A congestionnotification message is then sent to either one of the randomly sampleddata flows, or the last throttled flow, based upon which data flows hashigher congestion index. In this way, we can progressively identify andthrottle the flow with the highest buffer occupancy, and avoidthrottling flows with low occupancy.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the disclosure.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of onemore other features, integers, steps, operations, element components,and/or groups thereof.

The flow diagrams depicted herein are just one example. There may bemany variations to this diagram or the steps (or operations) describedtherein without departing from the spirit of the disclosure. Forinstance, the steps may be performed in a differing order or steps maybe added, deleted or modified. All of these variations are considered apart of the claimed disclosure.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present disclosure has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the disclosure in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of the disclosure and the practical application, and toenable others of ordinary skill in the art to understand the disclosurefor various embodiments with various modifications as are suited to theparticular use contemplated

While the preferred embodiment to the disclosure had been described, itwill be understood that those skilled in the art, both now and in thefuture, may make various improvements and enhancements which fall withinthe scope of the claims which follow. These claims should be construedto maintain the proper protection for the disclosure first described.

What is claimed is:
 1. A processing system for hierarchical occupancybased congestion management comprising: a processor and a bufferembodied in a non-transitory computer readable storage medium comprisinga plurality of buffer units for storing packets of a data flow receivedfrom one or more sources; a buffer manager, executed by the processor,that stores information about the packets stored in the buffer,including a selection criterion associated with each of the sources anda recent arrival counter associated with the data flow, if the data flowis inactive, the recent arrival counter associated with the inactivedata flow is zero, if the inactive data flow is randomly selected forthrottling, no congestion notification is sent to a source associatedwith the inactive flow, if the data flow is active, and the active dataflow is selected for throttling, a congestion notification is sent to asource associated with the active flow, wherein the recent arrivalcounter is decremented each time the congestion notification message issent to the associated source; a congestion estimator that monitors acongestion level in the buffer; an occupancy sampler that randomlyselects at least two occupied buffer units from the plurality of bufferunits by concurrently checking more than one buffer units and identifiesthe source of the packets stored in each of the occupied buffer units;and a congestion notification message generator that generates thecongestion notification message; wherein if the congestion level in thebuffer exceeds a threshold value the congestion notification message issent to the identified source or to the source of a last data flowthrottled depending on which source has a higher selection criteria,wherein the selection criterion is a relative occupancy percentage ofthe buffer associated with the data flow.
 2. The system of claim 1,wherein the selection criterion is a congestion level of a downstreamlink in a path of the data flow.
 3. The system of claim 1, wherein theselection criterion is an averaged congestion level of a plurality ofdownstream links in a path of the data flow.
 4. The system of claim 1,wherein the congestion notification message instructs the source toreduce its data transmission rate.
 5. The system of claim 1, whereindetermining if the buffer is congested is triggered by an arrival ofdata packet at the buffer.
 6. The system of claim 1, wherein determiningif the buffer is congested is done on a periodic basis.